Internet Traffic Classification based on Fuzzy Kernel K-means Clustering
نویسندگان
چکیده
Internet traffic classification based on flow statistics using machine learning method has attracted great attention. To solve the drawback of the fuzzy K-Means clustering algorithm to meet the requirements of the Internet network classification, we propose Internet traffic classification based on fuzzy kernel K-Means clustering. This method overcomes the dependence of clustering algorithm on sample distribution form. Experiment results illustrate this method can eliminate the influence of the shape of sample space on clustering accuracy. It also can classify Internet network traffic with high accuracy.
منابع مشابه
Modification of the Fast Global K-means Using a Fuzzy Relation with Application in Microarray Data Analysis
Recognizing genes with distinctive expression levels can help in prevention, diagnosis and treatment of the diseases at the genomic level. In this paper, fast Global k-means (fast GKM) is developed for clustering the gene expression datasets. Fast GKM is a significant improvement of the k-means clustering method. It is an incremental clustering method which starts with one cluster. Iteratively ...
متن کاملProposing a Novel Cost Sensitive Imbalanced Classification Method based on Hybrid of New Fuzzy Cost Assigning Approaches, Fuzzy Clustering and Evolutionary Algorithms
In this paper, a new hybrid methodology is introduced to design a cost-sensitive fuzzy rule-based classification system. A novel cost metric is proposed based on the combination of three different concepts: Entropy, Gini index and DKM criterion. In order to calculate the effective cost of patterns, a hybrid of fuzzy c-means clustering and particle swarm optimization algorithm is utilized. This ...
متن کاملDifferent Objective Functions in Fuzzy c-Means Algorithms and Kernel-Based Clustering
An overview of fuzzy c-means clustering algorithms is given where we focus on different objective functions: they use regularized dissimilarity, entropy-based function, and function for possibilistic clustering. Classification functions for the objective functions and their properties are studied. Fuzzy c-means algorithms using kernel functions is also discussed with kernelized cluster validity...
متن کاملKernel-based fuzzy clustering and fuzzy clustering: A comparative experimental study
In this study, we present a comprehensive comparative analysis of kernel-based fuzzy clustering and fuzzy clustering. Kernel based clustering has emerged as an interesting and quite visible alternative in fuzzy clustering, however, the effectiveness of this extension vis-à-vis some generic methods of fuzzy clustering has neither been discussed in a complete manner nor the performance of cluster...
متن کاملLink-based Community Detection with the Commute-Time Kernel
The main purpose of this work is to find communities in a weighted, undirected, graph by using kernel-based clustering methods, directly partitioning the graph according to a well-defined similarity measure between the nodes (a kernel on a graph). The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel (KCT), providing a meaningful similarity measure between any c...
متن کامل